A Baseline Correction Algorithm for FAST

نویسندگان

چکیده

Abstract The Five-hundred-meter Aperture Spherical radio Telescope (FAST) is the most sensitive ground-based, single-dish telescope on Earth. However, original H i spectra produced by FAST are affected standing waves. To maximize power of for high-sensitivity observations, we proposed an algorithm that combines fast Fourier transforms and extreme envelope curves to automatically correct baselines remove waves from baselines. This can reduce amplified noise level caused a near-ideal without losing signals or introducing false signals. root mean square average baseline reaches ∼8 mK, approaching theoretical sensitivity spectrum integration time 335 minutes, i.e., ∼6 mK.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal fast digital error correction method of pipelined analog to digital converter with DLMS algorithm

In this paper, convergence rate of digital error correction algorithm in correction of capacitor mismatch error and finite and nonlinear gain of Op-Amp has increased significantly by the use of DLMS, an evolutionary search algorithm. To this end, a 16-bit pipelined analog to digital converter was modeled. The obtained digital model is a FIR filter with 16 adjustable weights. To adjust weights o...

متن کامل

A fast statistical significance test for baseline correction and comparative analysis in phase locking

Human perception, cognition, and action are supported by a complex network of interconnected brain regions. There is an increasing interest in measuring and characterizing these networks as a function of time and frequency, and inter-areal phase locking is often used to reveal these networks. This measure assesses the consistency of phase angles between the electrophysiological activity in two ...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research in Astronomy and Astrophysics

سال: 2022

ISSN: ['1674-4527', '2397-6209']

DOI: https://doi.org/10.1088/1674-4527/ac7d43